Fast LP models and algorithms for identical jobs on uniform parallel machines
نویسندگان
چکیده
منابع مشابه
Flowshop scheduling with identical jobs and uniform parallel machines
The single-stage scheduling problem to minimize the makespan of identical jobs on uniform parallel machines is known to be solvable in polynomial-time. We extend this work to consider multi-stage systems with flowshop configuration. We show that the 2-stage problem may also be solved in polynomial-time and for the number of stages greater than two, the problem is shown to be NP-hard. We present...
متن کاملHeuristic Algorithms For Scheduling Jobs On Identical Parallel Machines Via Measures Of Spread
Constructive heuristics for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective are described. The proposed algorithms, which are n log n algorithms as the LPT algorithm of Graham, iteratively combine partial solutions that are obtained by partitioning the set of jobs into suitable families of subsets. The procedure used to partition the...
متن کاملImproved approximation algorithms for scheduling parallel jobs on identical clusters
The Multiple Cluster Scheduling Problem corresponds to minimize the maximum completion time (makespan) of a set of n parallel rigid (and non-preemptive) jobs submitted to N identical clusters. It cannot be approximated with a ratio better than 2 (unless P = NP). We present in this paper the methodology that encompasses several existing results [1, 2]. We detail first how to apply it for obtaini...
متن کاملOnline scheduling of two type parallel jobs on identical machines
In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using " temporary schedule " .
متن کاملScheduling equal-length jobs on identical parallel machines
We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions fi of the completion time Ci of each job Ji, the problem can be solved in polynomial time for any fixed value of m. The only restriction is that functions fi have to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2013
ISSN: 0307-904X
DOI: 10.1016/j.apm.2012.07.023